Matching graphs of hypercubes and complete bipartite graphs
نویسندگان
چکیده
منابع مشابه
Matching graphs of Hypercubes and Complete Bipartite Graphs
Kreweras’ conjecture [1] asserts that every perfect matching of the hypercube Qd can be extended to a Hamiltonian cycle. We [2] proved this conjecture but here we present a simplified proof. The matching graph M(G) of a graph G has a vertex set of all perfect matchings of G, with two vertices being adjacent whenever the union of the corresponding perfect matchings forms a Hamiltonian cycle. We ...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملRouting Numbers of Cycles, Complete Bipartite Graphs, and Hypercubes
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In this paper, we study the routing numbers of cycles, complete bipartite graphs, and hypercubes. We prove that rt(Cn) = n − 1 (for n ≥ 3) and for s ≥ t, rt(Ks,t) = 3s 2t + O(1). We also prove n + 1 ≤ rt(Qn) ≤ 2n − 2 for ...
متن کاملCyclic type factorizations of complete bipartite graphs into hypercubes
So far, the smallest complete bipartite graph which was known to have a cyclic type decomposition into cubes Qd of a given dimension d was Kd2d−2,d2d−2. Using binary Hamming codes we prove in this paper that there exists a cyclic type factorization of K2d−1,2d−1 into Qd if and only if d is a power of 2.
متن کاملMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) + ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2009
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2009.03.007